A QR Decomposition Algorithm with Partial Greedy Permutation for Zero-Forcing Block Diagonalization

A new zero-forcing block diagonalization (ZF-BD) scheme that enables both a more simplified ZF-BD and further increase in sum rate of MU-MIMO channels is proposed this paper. The provides the improvement BER performance for equivalent SU-MIMO channels. consists two components. First, permuted channel matrix (PCM), which given by moving submatrix related to target user bottom downlink MIMO matrix, newly defined obtain precoding ZF-BD. Executing QR decomposition alone PCM null space user. Second, partial MSQRD (PMSQRD) algorithm, adopts only provide bit user, proposed. Some numerical simulations are performed, results show total system. In addition, appropriate allocation improves error (BER) each channel. successive interference cancellation applied achieve terminals.